0.03/0.12	% Problem    : SLH456^1 : TPTP v7.5.0. Released v7.5.0.
0.03/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer : n007.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 30
0.13/0.34	% WCLimit    : 30
0.13/0.34	% DateTime   : Tue Aug  9 02:48:12 EDT 2022
0.13/0.34	% CPUTime    : 
0.19/0.47	The problem SPC is TH0_THM_EQU_NAR
0.19/0.47	Running higher-order on 1 cores theorem proving
0.19/0.47	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.19/0.47	# Version: 3.0pre003-ho
2.21/2.47	# Preprocessing class: HSLSSMSSSSLCHSA.
2.21/2.47	# Scheduled 1 strats onto 1 cores with 30 seconds (30 total)
2.21/2.47	# Starting sh2 with 30s (1) cores
2.21/2.47	# sh2 with pid 25664 completed with status 0
2.21/2.47	# Result found by sh2
2.21/2.47	# Preprocessing class: HSLSSMSSSSLCHSA.
2.21/2.47	# Scheduled 1 strats onto 1 cores with 30 seconds (30 total)
2.21/2.47	# Starting sh2 with 30s (1) cores
2.21/2.47	# No SInE strategy applied
2.21/2.47	# Search class: HGHSM-FSLM32-MHSFFSBN
2.21/2.47	# Scheduled 5 strats onto 1 cores with 30 seconds (30 total)
2.21/2.47	# Starting new_ho_10 with 17s (1) cores
2.21/2.47	# new_ho_10 with pid 25665 completed with status 0
2.21/2.47	# Result found by new_ho_10
2.21/2.47	# Preprocessing class: HSLSSMSSSSLCHSA.
2.21/2.47	# Scheduled 1 strats onto 1 cores with 30 seconds (30 total)
2.21/2.47	# Starting sh2 with 30s (1) cores
2.21/2.47	# No SInE strategy applied
2.21/2.47	# Search class: HGHSM-FSLM32-MHSFFSBN
2.21/2.47	# Scheduled 5 strats onto 1 cores with 30 seconds (30 total)
2.21/2.47	# Starting new_ho_10 with 17s (1) cores
2.21/2.47	# Preprocessing time       : 0.014 s
2.21/2.47	# Presaturation interreduction done
2.21/2.47	
2.21/2.47	# Proof found!
2.21/2.47	# SZS status Theorem
2.21/2.47	# SZS output start CNFRefutation
2.21/2.47	thf(decl_22, type, binary717961607le_T_a: binary1439146945Tree_a > a > binary1439146945Tree_a > binary1439146945Tree_a).
2.21/2.47	thf(decl_23, type, binary476621312_Tip_a: binary1439146945Tree_a).
2.21/2.47	thf(decl_24, type, binary256242811Tree_a: binary1439146945Tree_a > set_a).
2.21/2.47	thf(decl_25, type, binary1226383794sert_a: (a > int) > a > binary1439146945Tree_a > binary1439146945Tree_a).
2.21/2.47	thf(decl_26, type, binary504661350_eqs_a: (a > int) > a > set_a).
2.21/2.47	thf(decl_27, type, binary2053421120memb_a: (a > int) > a > binary1439146945Tree_a > $o).
2.21/2.47	thf(decl_28, type, binary945792244etOf_a: binary1439146945Tree_a > set_a).
2.21/2.47	thf(decl_29, type, binary1721989714Tree_a: (a > int) > binary1439146945Tree_a > $o).
2.21/2.47	thf(decl_30, type, binary670562003pred_a: (a > int) > a > a > binary1439146945Tree_a > $o).
2.21/2.47	thf(decl_31, type, minus_minus_a_o: (a > $o) > (a > $o) > a > $o).
2.21/2.47	thf(decl_32, type, minus_minus_o: $o > $o > $o).
2.21/2.47	thf(decl_33, type, minus_minus_int: int > int > int).
2.21/2.47	thf(decl_34, type, minus_minus_set_a: set_a > set_a > set_a).
2.21/2.47	thf(decl_35, type, the_a: (a > $o) > a).
2.21/2.47	thf(decl_36, type, sup_sup_a_o: (a > $o) > (a > $o) > a > $o).
2.21/2.47	thf(decl_37, type, sup_sup_o: $o > $o > $o).
2.21/2.47	thf(decl_38, type, sup_sup_int: int > int > int).
2.21/2.47	thf(decl_39, type, sup_sup_set_a: set_a > set_a > set_a).
2.21/2.47	thf(decl_40, type, bot_bot_a_o: a > $o).
2.21/2.47	thf(decl_41, type, bot_bot_o: $o).
2.21/2.47	thf(decl_42, type, bot_bot_set_a: set_a).
2.21/2.47	thf(decl_43, type, ord_less_a_o: (a > $o) > (a > $o) > $o).
2.21/2.47	thf(decl_44, type, ord_less_int: int > int > $o).
2.21/2.47	thf(decl_45, type, ord_less_set_a: set_a > set_a > $o).
2.21/2.47	thf(decl_46, type, ord_less_eq_a_o: (a > $o) > (a > $o) > $o).
2.21/2.47	thf(decl_47, type, ord_less_eq_int: int > int > $o).
2.21/2.47	thf(decl_48, type, ord_less_eq_set_a: set_a > set_a > $o).
2.21/2.47	thf(decl_49, type, collect_a: (a > $o) > set_a).
2.21/2.47	thf(decl_50, type, insert_a: a > set_a > set_a).
2.21/2.47	thf(decl_51, type, is_empty_a: set_a > $o).
2.21/2.47	thf(decl_52, type, is_singleton_a: set_a > $o).
2.21/2.47	thf(decl_53, type, pairwise_a: (a > a > $o) > set_a > $o).
2.21/2.47	thf(decl_54, type, remove_a: a > set_a > set_a).
2.21/2.47	thf(decl_55, type, the_elem_a: set_a > a).
2.21/2.47	thf(decl_56, type, member_a: a > set_a > $o).
2.21/2.47	thf(decl_57, type, e: a).
2.21/2.47	thf(decl_58, type, h: a > int).
2.21/2.47	thf(decl_59, type, t1: binary1439146945Tree_a).
2.21/2.47	thf(decl_60, type, t2: binary1439146945Tree_a).
2.21/2.47	thf(decl_61, type, x: a).
2.21/2.47	thf(decl_62, type, epred1_3: a > (a > $o) > (a > $o) > $o).
2.21/2.47	thf(decl_63, type, epred2_3: a > (a > $o) > (a > $o) > $o).
2.21/2.47	thf(decl_64, type, epred3_3: a > (a > $o) > (a > $o) > $o).
2.21/2.47	thf(decl_65, type, epred4_3: a > (a > $o) > (a > $o) > $o).
2.21/2.47	thf(decl_66, type, esk1_1: int > int).
2.21/2.47	thf(decl_67, type, esk2_1: int > int).
2.21/2.47	thf(decl_68, type, esk3_1: int > int).
2.21/2.47	thf(decl_69, type, esk4_1: int > int).
2.21/2.47	thf(decl_70, type, esk5_3: (int > $o) > (int > $o) > int > int).
2.21/2.47	thf(decl_71, type, esk6_5: (int > $o) > (int > $o) > (int > $o) > (int > $o) > int > int).
2.21/2.47	thf(decl_72, type, esk7_4: (int > $o) > (int > $o) > (int > $o) > (int > $o) > int).
2.21/2.47	thf(decl_73, type, esk8_3: (int > $o) > (int > $o) > int > int).
2.21/2.47	thf(decl_74, type, esk9_5: (int > $o) > (int > $o) > (int > $o) > (int > $o) > int > int).
2.21/2.47	thf(decl_75, type, esk10_4: (int > $o) > (int > $o) > (int > $o) > (int > $o) > int).
2.21/2.47	thf(decl_76, type, esk11_3: (int > $o) > (int > $o) > int > int).
2.21/2.47	thf(decl_77, type, esk12_5: (int > $o) > (int > $o) > (int > $o) > (int > $o) > int > int).
2.21/2.47	thf(decl_78, type, esk13_4: (int > $o) > (int > $o) > (int > $o) > (int > $o) > int).
2.21/2.47	thf(decl_79, type, esk14_3: (int > $o) > (int > $o) > int > int).
2.21/2.47	thf(decl_80, type, esk15_5: (int > $o) > (int > $o) > (int > $o) > (int > $o) > int > int).
2.21/2.47	thf(decl_81, type, esk16_4: (int > $o) > (int > $o) > (int > $o) > (int > $o) > int).
2.21/2.47	thf(decl_82, type, esk17_1: int > int).
2.21/2.47	thf(decl_83, type, esk18_1: int > int).
2.21/2.47	thf(decl_84, type, esk19_1: int > int).
2.21/2.47	thf(decl_85, type, esk20_1: int > int).
2.21/2.47	thf(decl_86, type, esk21_4: (a > int) > binary1439146945Tree_a > a > binary1439146945Tree_a > a).
2.21/2.47	thf(decl_87, type, esk22_4: (a > int) > binary1439146945Tree_a > a > binary1439146945Tree_a > a).
2.21/2.47	thf(decl_88, type, esk23_4: set_a > (int > set_a) > int > int > int).
2.21/2.47	thf(decl_89, type, esk24_4: set_a > (int > set_a) > int > int > int).
2.21/2.47	thf(decl_90, type, esk25_4: int > (set_a > int) > set_a > set_a > set_a).
2.21/2.47	thf(decl_91, type, esk26_4: int > (set_a > int) > set_a > set_a > set_a).
2.21/2.47	thf(decl_92, type, esk27_4: set_a > (set_a > set_a) > set_a > set_a > set_a).
2.21/2.47	thf(decl_93, type, esk28_4: set_a > (set_a > set_a) > set_a > set_a > set_a).
2.21/2.47	thf(decl_94, type, esk29_4: int > (int > int) > int > int > int).
2.21/2.47	thf(decl_95, type, esk30_4: int > (int > int) > int > int > int).
2.21/2.47	thf(decl_96, type, esk31_4: int > int > (int > set_a) > set_a > int).
2.21/2.47	thf(decl_97, type, esk32_4: int > int > (int > set_a) > set_a > int).
2.21/2.47	thf(decl_98, type, esk33_4: set_a > set_a > (set_a > int) > int > set_a).
2.21/2.47	thf(decl_99, type, esk34_4: set_a > set_a > (set_a > int) > int > set_a).
2.21/2.47	thf(decl_100, type, esk35_4: set_a > set_a > (set_a > set_a) > set_a > set_a).
2.21/2.47	thf(decl_101, type, esk36_4: set_a > set_a > (set_a > set_a) > set_a > set_a).
2.21/2.47	thf(decl_102, type, esk37_4: int > int > (int > int) > int > int).
2.21/2.47	thf(decl_103, type, esk38_4: int > int > (int > int) > int > int).
2.21/2.47	thf(decl_104, type, esk39_4: int > (set_a > int) > set_a > set_a > set_a).
2.21/2.47	thf(decl_105, type, esk40_4: int > (set_a > int) > set_a > set_a > set_a).
2.21/2.47	thf(decl_106, type, esk41_4: set_a > (int > set_a) > int > int > int).
2.21/2.47	thf(decl_107, type, esk42_4: set_a > (int > set_a) > int > int > int).
2.21/2.47	thf(decl_108, type, esk43_4: set_a > (set_a > set_a) > set_a > set_a > set_a).
2.21/2.47	thf(decl_109, type, esk44_4: set_a > (set_a > set_a) > set_a > set_a > set_a).
2.21/2.47	thf(decl_110, type, esk45_4: int > (int > int) > int > int > int).
2.21/2.47	thf(decl_111, type, esk46_4: int > (int > int) > int > int > int).
2.21/2.47	thf(decl_112, type, esk47_4: int > int > (int > set_a) > set_a > int).
2.21/2.47	thf(decl_113, type, esk48_4: int > int > (int > set_a) > set_a > int).
2.21/2.47	thf(decl_114, type, esk49_4: set_a > set_a > (set_a > int) > int > set_a).
2.21/2.47	thf(decl_115, type, esk50_4: set_a > set_a > (set_a > int) > int > set_a).
2.21/2.47	thf(decl_116, type, esk51_4: set_a > set_a > (set_a > set_a) > set_a > set_a).
2.21/2.47	thf(decl_117, type, esk52_4: set_a > set_a > (set_a > set_a) > set_a > set_a).
2.21/2.47	thf(decl_118, type, esk53_4: int > int > (int > int) > int > int).
2.21/2.47	thf(decl_119, type, esk54_4: int > int > (int > int) > int > int).
2.21/2.47	thf(decl_120, type, esk55_1: int > int).
2.21/2.47	thf(decl_121, type, esk56_1: int > int).
2.21/2.47	thf(decl_122, type, esk57_2: (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_123, type, esk58_1: (int > int > $o) > int).
2.21/2.47	thf(decl_124, type, esk59_1: (int > int > $o) > int).
2.21/2.47	thf(decl_125, type, esk60_1: (int > int > $o) > int).
2.21/2.47	thf(decl_126, type, esk61_1: (int > int > $o) > int).
2.21/2.47	thf(decl_127, type, esk62_1: (int > int > $o) > int).
2.21/2.47	thf(decl_128, type, esk63_1: (binary1439146945Tree_a > $o) > binary1439146945Tree_a).
2.21/2.47	thf(decl_129, type, esk64_1: (binary1439146945Tree_a > $o) > a).
2.21/2.47	thf(decl_130, type, esk65_1: (binary1439146945Tree_a > $o) > binary1439146945Tree_a).
2.21/2.47	thf(decl_131, type, esk66_1: binary1439146945Tree_a > binary1439146945Tree_a).
2.21/2.47	thf(decl_132, type, esk67_1: binary1439146945Tree_a > a).
2.21/2.47	thf(decl_133, type, esk68_1: binary1439146945Tree_a > binary1439146945Tree_a).
2.21/2.47	thf(decl_134, type, esk69_1: (a > $o) > a).
2.21/2.47	thf(decl_135, type, esk70_1: (a > $o) > a).
2.21/2.47	thf(decl_136, type, esk71_1: set_a > a).
2.21/2.47	thf(decl_137, type, esk72_1: set_a > a).
2.21/2.47	thf(decl_138, type, esk73_1: set_a > a).
2.21/2.47	thf(decl_139, type, esk74_2: a > set_a > set_a).
2.21/2.47	thf(decl_140, type, esk75_4: a > set_a > a > set_a > set_a).
2.21/2.47	thf(decl_141, type, esk76_2: a > set_a > set_a).
2.21/2.47	thf(decl_142, type, esk77_3: set_a > set_a > (a > $o) > a).
2.21/2.47	thf(decl_143, type, esk78_3: set_a > set_a > (a > $o) > a).
2.21/2.47	thf(decl_144, type, esk79_3: set_a > set_a > (a > $o) > a).
2.21/2.47	thf(decl_145, type, esk80_3: set_a > set_a > (a > $o) > a).
2.21/2.47	thf(decl_146, type, esk81_3: set_a > set_a > (a > $o) > a).
2.21/2.47	thf(decl_147, type, esk82_3: set_a > set_a > (a > $o) > a).
2.21/2.47	thf(decl_148, type, esk83_2: set_a > set_a > a).
2.21/2.47	thf(decl_149, type, esk84_1: set_a > a).
2.21/2.47	thf(decl_150, type, esk85_1: set_a > a).
2.21/2.47	thf(decl_151, type, esk86_1: set_a > a).
2.21/2.47	thf(decl_152, type, esk87_1: set_a > a).
2.21/2.47	thf(decl_153, type, esk88_2: a > binary1439146945Tree_a > binary1439146945Tree_a).
2.21/2.47	thf(decl_154, type, esk89_2: a > binary1439146945Tree_a > a).
2.21/2.47	thf(decl_155, type, esk90_2: a > binary1439146945Tree_a > binary1439146945Tree_a).
2.21/2.47	thf(decl_156, type, esk91_2: a > binary1439146945Tree_a > binary1439146945Tree_a).
2.21/2.47	thf(decl_157, type, esk92_2: a > binary1439146945Tree_a > binary1439146945Tree_a).
2.21/2.47	thf(decl_158, type, esk93_2: a > binary1439146945Tree_a > binary1439146945Tree_a).
2.21/2.47	thf(decl_159, type, esk94_2: a > binary1439146945Tree_a > a).
2.21/2.47	thf(decl_160, type, esk95_2: a > binary1439146945Tree_a > binary1439146945Tree_a).
2.21/2.47	thf(decl_161, type, esk96_2: (a > a > $o) > set_a > a).
2.21/2.47	thf(decl_162, type, esk97_2: (a > a > $o) > set_a > a).
2.21/2.47	thf(decl_163, type, esk98_2: set_a > set_a > a).
2.21/2.47	thf(decl_164, type, esk99_0: a).
2.21/2.47	thf(decl_165, type, esk100_0: a).
2.21/2.47	thf(decl_166, type, epred5_1: set_a > a > $o).
2.21/2.47	thf(decl_167, type, epred6_1: a > a > $o).
2.21/2.47	thf(decl_168, type, epred7_2: set_a > set_a > a > $o).
2.21/2.47	thf(decl_169, type, epred8_0: a > $o).
2.21/2.47	thf(decl_170, type, epred9_2: (a > $o) > a > a > $o).
2.21/2.47	thf(decl_171, type, epred10_2: (a > $o) > (a > $o) > a > $o).
2.21/2.47	thf(decl_172, type, epred11_2: (a > $o) > a > a > $o).
2.21/2.47	thf(decl_173, type, epred12_2: a > (a > int) > a > $o).
2.21/2.47	thf(decl_174, type, epred13_2: (a > $o) > a > a > $o).
2.21/2.47	thf(decl_175, type, epred14_2: set_a > a > a > $o).
2.21/2.47	thf(decl_176, type, epred15_2: set_a > set_a > a > $o).
2.21/2.47	thf(decl_177, type, epred16_1: set_a > a > $o).
2.21/2.47	thf(decl_178, type, esk101_2: (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_179, type, esk102_2: (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_180, type, esk103_2: (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_181, type, esk104_2: (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_182, type, esk105_2: (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_183, type, esk106_2: (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_184, type, esk107_2: (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_185, type, esk108_2: (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_186, type, esk109_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_187, type, esk110_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_188, type, esk111_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_189, type, esk112_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_190, type, esk113_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_191, type, esk114_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_192, type, esk115_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_193, type, esk116_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_194, type, esk117_2: (a > $o) > set_a > a).
2.21/2.47	thf(decl_195, type, esk118_2: set_a > (a > $o) > a).
2.21/2.47	thf(decl_196, type, esk119_2: set_a > set_a > a).
2.21/2.47	thf(decl_197, type, esk120_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_198, type, esk121_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_199, type, esk122_2: (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_200, type, esk123_2: (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_201, type, esk124_2: (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_202, type, esk125_2: (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_203, type, esk126_2: (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_204, type, esk127_3: (a > $o) > (a > $o) > a > a).
2.21/2.47	thf(decl_205, type, esk128_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_206, type, esk129_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_207, type, esk130_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_208, type, esk131_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_209, type, esk132_3: (a > $o) > set_a > a > a).
2.21/2.47	thf(decl_210, type, esk133_3: (a > $o) > set_a > set_a > a).
2.21/2.47	thf(decl_211, type, esk134_3: (a > $o) > set_a > set_a > a).
2.21/2.47	thf(decl_212, type, esk135_2: (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_213, type, esk136_2: (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_214, type, esk137_3: set_a > (a > $o) > a > a).
2.21/2.47	thf(decl_215, type, esk138_2: set_a > a > a).
2.21/2.47	thf(decl_216, type, esk139_3: (a > $o) > (a > $o) > a > a).
2.21/2.47	thf(decl_217, type, esk140_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_218, type, esk141_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_219, type, esk142_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_220, type, esk143_3: (a > $o) > set_a > a > a).
2.21/2.47	thf(decl_221, type, esk144_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_222, type, esk145_3: set_a > (a > $o) > a > a).
2.21/2.47	thf(decl_223, type, esk146_3: set_a > set_a > (a > $o) > a).
2.21/2.47	thf(decl_224, type, esk147_3: set_a > set_a > (a > $o) > a).
2.21/2.47	thf(decl_225, type, esk148_2: a > (a > $o) > a).
2.21/2.47	thf(decl_226, type, esk149_1: a > a).
2.21/2.47	thf(decl_227, type, esk150_2: (a > $o) > a > a).
2.21/2.47	thf(decl_228, type, esk151_3: (a > $o) > (a > $o) > a > a).
2.21/2.47	thf(decl_229, type, esk152_2: (a > $o) > a > a).
2.21/2.47	thf(decl_230, type, esk153_3: (a > $o) > (a > $o) > a > a).
2.21/2.47	thf(decl_231, type, esk154_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_232, type, esk155_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_233, type, esk156_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_234, type, esk157_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_235, type, esk158_3: (a > $o) > (a > int) > a > a).
2.21/2.47	thf(decl_236, type, esk159_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_237, type, esk160_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_238, type, esk161_3: (a > $o) > set_a > set_a > a).
2.21/2.47	thf(decl_239, type, esk162_2: set_a > set_a > a).
2.21/2.47	thf(decl_240, type, esk163_2: set_a > set_a > a).
2.21/2.47	thf(decl_241, type, esk164_1: set_a > a).
2.21/2.47	thf(decl_242, type, esk165_1: set_a > a).
2.21/2.47	thf(decl_243, type, esk166_1: set_a > a).
2.21/2.47	thf(decl_244, type, esk167_0: a).
2.21/2.47	thf(decl_245, type, esk168_0: a).
2.21/2.47	thf(decl_246, type, esk169_1: set_a > a).
2.21/2.47	thf(decl_247, type, esk170_1: set_a > a).
2.21/2.47	thf(decl_248, type, esk171_2: (a > $o) > a > a).
2.21/2.47	thf(decl_249, type, esk172_3: (a > $o) > set_a > a > a).
2.21/2.47	thf(decl_250, type, esk173_2: a > set_a > a).
2.21/2.47	thf(decl_251, type, esk174_3: (a > $o) > (a > $o) > a > a).
2.21/2.47	thf(decl_252, type, esk175_3: a > (a > int) > (a > $o) > a).
2.21/2.47	thf(decl_253, type, esk176_2: (a > $o) > a > a).
2.21/2.47	thf(decl_254, type, esk177_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_255, type, esk178_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_256, type, esk179_2: a > (a > $o) > a).
2.21/2.47	thf(decl_257, type, esk180_3: set_a > set_a > (a > $o) > a).
2.21/2.47	thf(decl_258, type, esk181_3: set_a > (a > $o) > a > a).
2.21/2.47	thf(decl_259, type, esk182_3: (a > $o) > (a > $o) > a > a).
2.21/2.47	thf(decl_260, type, esk183_2: a > (a > $o) > a).
2.21/2.47	thf(decl_261, type, esk184_1: (a > $o) > a).
2.21/2.47	thf(decl_262, type, esk185_0: a).
2.21/2.47	thf(decl_263, type, esk186_1: a > a).
2.21/2.47	thf(decl_264, type, esk187_1: set_a > a).
2.21/2.47	thf(decl_265, type, esk188_1: set_a > a).
2.21/2.47	thf(decl_266, type, esk189_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_267, type, esk190_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_268, type, esk191_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_269, type, esk192_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_270, type, esk193_0: a).
2.21/2.47	thf(decl_271, type, esk194_3: (a > $o) > set_a > set_a > a).
2.21/2.47	thf(decl_272, type, esk195_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_273, type, esk196_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_274, type, esk197_2: (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_275, type, esk198_2: (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_276, type, esk199_2: (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_277, type, esk200_2: (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_278, type, esk201_3: set_a > set_a > (a > $o) > a).
2.21/2.47	thf(decl_279, type, esk202_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_280, type, esk203_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_281, type, esk204_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_282, type, esk205_1: binary1439146945Tree_a > a).
2.21/2.47	thf(decl_283, type, esk206_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_284, type, esk207_2: set_a > set_a > a).
2.21/2.47	thf(decl_285, type, esk208_2: set_a > set_a > a).
2.21/2.47	thf(decl_286, type, esk209_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(decl_287, type, esk210_3: (a > $o) > (a > $o) > (a > $o) > a).
2.21/2.47	thf(fact_92_dual__order_Ostrict__trans, axiom, ![X169:int, X170:int, X50:int]:(((ord_less_int @ X169 @ X170)=>((ord_less_int @ X50 @ X169)=>(ord_less_int @ X50 @ X170)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_92_dual__order_Ostrict__trans)).
2.21/2.47	thf(fact_2_t1LessX, axiom, ![X1:a]:(((member_a @ X1 @ (binary945792244etOf_a @ t1))=>(ord_less_int @ (h @ X1) @ (h @ x)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_2_t1LessX)).
2.21/2.47	thf(conj_0, conjecture, ![X472:a]:(((member_a @ X472 @ (binary504661350_eqs_a @ h @ e))=>![X473:a]:(((member_a @ X473 @ (binary945792244etOf_a @ t1))=>(ord_less_int @ (h @ X473) @ (h @ X472)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)).
2.21/2.47	thf(fact_3_XLessEqs, axiom, ![X1:a]:(((member_a @ X1 @ (binary504661350_eqs_a @ h @ e))=>(ord_less_int @ (h @ x) @ (h @ X1)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_3_XLessEqs)).
2.21/2.47	thf(c_0_4, plain, ![X1649:int, X1650:int, X1651:int]:((~(ord_less_int @ X1649 @ X1650)|(~(ord_less_int @ X1651 @ X1649)|(ord_less_int @ X1651 @ X1650)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_92_dual__order_Ostrict__trans])])).
2.21/2.47	thf(c_0_5, plain, ![X1337:a]:((~(member_a @ X1337 @ (binary945792244etOf_a @ t1))|(ord_less_int @ (h @ X1337) @ (h @ x)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_2_t1LessX])])).
2.21/2.47	thf(c_0_6, negated_conjecture, ~(![X472:a]:(((member_a @ X472 @ (binary504661350_eqs_a @ h @ e))=>![X473:a]:(((member_a @ X473 @ (binary945792244etOf_a @ t1))=>(ord_less_int @ (h @ X473) @ (h @ X472))))))), inference(assume_negation,[status(cth)],[conj_0])).
2.21/2.47	thf(c_0_7, plain, ![X3:int, X4:int, X2:int]:(((ord_less_int @ X4 @ X3)|~((ord_less_int @ X2 @ X3))|~((ord_less_int @ X4 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_4])).
2.21/2.47	thf(c_0_8, plain, ![X1:a]:(((ord_less_int @ (h @ X1) @ (h @ x))|~((member_a @ X1 @ (binary945792244etOf_a @ t1))))), inference(split_conjunct,[status(thm)],[c_0_5])).
2.21/2.47	thf(c_0_9, negated_conjecture, ((member_a @ esk99_0 @ (binary504661350_eqs_a @ h @ e))&((member_a @ esk100_0 @ (binary945792244etOf_a @ t1))&~(ord_less_int @ (h @ esk100_0) @ (h @ esk99_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])).
2.21/2.47	thf(c_0_10, plain, ![X1338:a]:((~(member_a @ X1338 @ (binary504661350_eqs_a @ h @ e))|(ord_less_int @ (h @ x) @ (h @ X1338)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_3_XLessEqs])])).
2.21/2.47	thf(c_0_11, plain, ![X2:int, X1:a]:(((ord_less_int @ (h @ X1) @ X2)|~((ord_less_int @ (h @ x) @ X2))|~((member_a @ X1 @ (binary945792244etOf_a @ t1))))), inference(spm,[status(thm)],[c_0_7, c_0_8])).
2.21/2.47	thf(c_0_12, negated_conjecture, (member_a @ esk100_0 @ (binary945792244etOf_a @ t1)), inference(split_conjunct,[status(thm)],[c_0_9])).
2.21/2.47	thf(c_0_13, plain, ![X1:a]:(((ord_less_int @ (h @ x) @ (h @ X1))|~((member_a @ X1 @ (binary504661350_eqs_a @ h @ e))))), inference(split_conjunct,[status(thm)],[c_0_10])).
2.21/2.47	thf(c_0_14, negated_conjecture, (member_a @ esk99_0 @ (binary504661350_eqs_a @ h @ e)), inference(split_conjunct,[status(thm)],[c_0_9])).
2.21/2.47	thf(c_0_15, negated_conjecture, ~((ord_less_int @ (h @ esk100_0) @ (h @ esk99_0))), inference(split_conjunct,[status(thm)],[c_0_9])).
2.21/2.47	thf(c_0_16, negated_conjecture, ![X2:int]:(((ord_less_int @ (h @ esk100_0) @ X2)|~((ord_less_int @ (h @ x) @ X2)))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
2.21/2.47	thf(c_0_17, negated_conjecture, (ord_less_int @ (h @ x) @ (h @ esk99_0)), inference(spm,[status(thm)],[c_0_13, c_0_14])).
2.21/2.47	thf(c_0_18, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])]), ['proof']).
2.21/2.47	# SZS output end CNFRefutation
2.21/2.47	# Parsed axioms                        : 376
2.21/2.47	# Removed by relevancy pruning/SinE    : 0
2.21/2.47	# Initial clauses                      : 858
2.21/2.47	# Removed in clause preprocessing      : 106
2.21/2.47	# Initial clauses in saturation        : 752
2.21/2.47	# Processed clauses                    : 5902
2.21/2.47	# ...of these trivial                  : 182
2.21/2.47	# ...subsumed                          : 2395
2.21/2.47	# ...remaining for further processing  : 3325
2.21/2.47	# Other redundant clauses eliminated   : 905
2.21/2.47	# Clauses deleted for lack of memory   : 0
2.21/2.47	# Backward-subsumed                    : 79
2.21/2.47	# Backward-rewritten                   : 57
2.21/2.47	# Generated clauses                    : 140084
2.21/2.47	# ...of the previous two non-redundant : 134282
2.21/2.47	# ...aggressively subsumed             : 0
2.21/2.47	# Contextual simplify-reflections      : 85
2.21/2.47	# Paramodulations                      : 138608
2.21/2.47	# Factorizations                       : 34
2.21/2.47	# NegExts                              : 110
2.21/2.47	# Equation resolutions                 : 930
2.21/2.47	# Propositional unsat checks           : 0
2.21/2.47	#    Propositional check models        : 0
2.21/2.47	#    Propositional check unsatisfiable : 0
2.21/2.47	#    Propositional clauses             : 0
2.21/2.47	#    Propositional clauses after purity: 0
2.21/2.47	#    Propositional unsat core size     : 0
2.21/2.47	#    Propositional preprocessing time  : 0.000
2.21/2.47	#    Propositional encoding time       : 0.000
2.21/2.47	#    Propositional solver time         : 0.000
2.21/2.47	#    Success case prop preproc time    : 0.000
2.21/2.47	#    Success case prop encoding time   : 0.000
2.21/2.47	#    Success case prop solver time     : 0.000
2.21/2.47	# Current number of processed clauses  : 2423
2.21/2.47	#    Positive orientable unit clauses  : 218
2.21/2.47	#    Positive unorientable unit clauses: 17
2.21/2.47	#    Negative unit clauses             : 173
2.21/2.47	#    Non-unit-clauses                  : 2015
2.21/2.47	# Current number of unprocessed clauses: 129347
2.21/2.47	# ...number of literals in the above   : 476262
2.21/2.47	# Current number of archived formulas  : 0
2.21/2.47	# Current number of archived clauses   : 821
2.21/2.47	# Clause-clause subsumption calls (NU) : 721644
2.21/2.47	# Rec. Clause-clause subsumption calls : 308638
2.21/2.47	# Non-unit clause-clause subsumptions  : 1451
2.21/2.47	# Unit Clause-clause subsumption calls : 20159
2.21/2.47	# Rewrite failures with RHS unbound    : 0
2.21/2.47	# BW rewrite match attempts            : 460
2.21/2.47	# BW rewrite match successes           : 259
2.21/2.47	# Condensation attempts                : 5903
2.21/2.47	# Condensation successes               : 35
2.21/2.47	# Termbank termtop insertions          : 2303426
2.21/2.47	
2.21/2.47	# -------------------------------------------------
2.21/2.47	# User time                : 1.920 s
2.21/2.47	# System time              : 0.065 s
2.21/2.47	# Total time               : 1.985 s
2.21/2.47	# Maximum resident set size: 5164 pages
2.21/2.47	
2.21/2.47	# -------------------------------------------------
2.21/2.47	# User time                : 1.930 s
2.21/2.47	# System time              : 0.069 s
2.21/2.47	# Total time               : 1.999 s
2.21/2.47	# Maximum resident set size: 2312 pages
2.21/2.47	EOF